Hamiltonian path

Results: 145



#Item
21NP-complete problems / Interval graph / Strongly chordal graph / Hamiltonian path / Longest path problem / Chordal graph / Indifference graph / Permutation graph / Path / Pathwidth / Graph minor

Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios ·

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2011-12-14 14:10:08
22NP-complete problems / Trapezoid graph / Interval graph / Perfect graph / Indifference graph / Independent set / Permutation graph / Clique problem / Hamiltonian path problem / Longest path problem / Pathwidth / Intersection graph

Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2009-12-21 16:02:55
23Graph theory / Mathematics / NP-complete problems / NP-hard problems / Graph coloring / Routing algorithms / Search algorithms / Hamiltonian path / Bipartite graph / Travelling salesman problem / A* search algorithm / Planar separator theorem

DISCRETE APPLIED MATHEMATICS ELSEYIER Discrete Applied

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2010-06-13 16:41:26
24Mathematics / Permutations / Linear algebra / Matrix theory / Algebra / Permanent / Computing the permanent / Permutation / Hamiltonian path / Tournament

ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2014-08-27 10:06:40
25

BRS AND ANTI-BRS INVARIANT STATES IN PATH INTEGRAL APPROACH TO HAMILTONIAN AND BIRKHOFFIAN MECHANICS A.K.Aringazin Department of Theoretical Physics

Add to Reading List

Source URL: www.i-b-r.org

Language: English - Date: 2002-01-03 22:13:14
    26Graph theory / Mathematics / NP-complete problems / NP-hard problems / Operations research / Travelling salesman problem / Matching / Eulerian path / Hamiltonian path / Minimum spanning tree / Cycle / Line graph

    Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007

    Add to Reading List

    Source URL: vigna.di.unimi.it

    Language: English - Date: 2014-10-22 08:43:20
    27Graph theory / Graph / Thrackle / Path / NP-complete problems / Hamiltonian path / Skew-symmetric graph

    Five $1,000 Problems - John H. Conway! ! ! !

    Add to Reading List

    Source URL: cheswick.com

    Language: English - Date: 2014-10-13 09:47:48
    28NP-complete problems / Graph / Graph theory / Matching / Cycle / Hamiltonian path / Spanning tree

    Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany

    Add to Reading List

    Source URL: www.zaik.uni-koeln.de

    Language: English - Date: 2014-10-02 11:19:31
    29

    Journal of Information Processing Vol.0 No.0 1–11 (??? DOI: ipsjjip.0.1] Regular Paper Finding a Hamiltonian Path in a Cube

    Add to Reading List

    Source URL: martindemaine.org

    Language: English - Date: 2015-08-07 09:44:55
      30

      Journal of Machine Learning Research1381 Submitted 11/11; Revised 10/13; Published 4/14 The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo

      Add to Reading List

      Source URL: www.stat.columbia.edu

      Language: English - Date: 2014-04-22 18:34:05
        UPDATE